Discrete fractional Fourier transform based on orthogonal projections
نویسندگان
چکیده
The continuous fractional Fourier transform (FRFT) performs a spectrum rotation of signal in the time–frequency plane, and it becomes an important tool for time-varying signal analysis. A discrete fractional Fourier transform has been recently developed by Santhanam and McClellan, but its results do not match those of the corresponding continuous fractional Fourier transforms. In this paper, we propose a new discrete fractional Fourier transform (DFRFT). The new DFRFT has DFT Hermite eigenvectors and retains the eigenvalue-eigenfunction relation as a continous FRFT. To obtain DFT Hermite eigenvectors, two orthogonal projection methods are introduced. Thus, the new DFRFT will provide similar transform and rotational properties as those of continuous fractional Fourier transforms. Moreover, the relationship between FRFT and the proposed DFRFT has been established in the same way as the conventional DFT-tocontinuous-Fourier transform.
منابع مشابه
Fractional Fourier Transform Based OFDMA for Doubly Dispersive Channels
The performance of Orthogonal Frequency Division Multiple Access (OFDMA) system degrades significantly in doubly dispersive channels. This is due to the fact that exponential sub-carriers do not match the singular functions of this type of channels. To solve this problem, we develop a system whose sub-carriers are chirp functions. This is equivalent to exploiting Fractional Fourier Transform (F...
متن کاملOn the Grunbaum Commutor Based Discrete Fractional Fourier Transform
The basis functions of the continuous fractional Fourier transform (FRFT) are linear chirp signals that are suitable for time-frequency analysis of signals with chirping timefrequency content. Efforts to develop a discrete computable version of the fractional Fourier transform (DFRFT) have focussed on furnishing a orthogonal set of eigenvectors for the DFT that serve as discrete versions of the...
متن کاملThe BER Vs SNR Performance of FRFT-OFDM Systems Using Convolution Code
Traditional Fast Fourier Transform algorithm makes the implementation of the multicarrier system feasible and attractive with respect to single-carrier systems. However, when the channel is doubly selective (i.e. time-frequencyselective), this traditional methodology fails. Since the channel frequency response is rapidly time-varying as a result the optimal transmission/reception methodology no...
متن کامل3D Fourier based discrete Radon transform
The Radon transform is a fundamental tool in many areas. For example, in reconstruction of an image from its projections (CT scanning). Recently A. Averbuch et al. [SIAM J. Sci. Comput., submitted for publication] developed a coherent discrete definition of the 2D discrete Radon transform for 2D discrete images. The definition in [SIAM J. Sci. Comput., submitted for publication] is shown to be ...
متن کاملThe discrete fractional Fourier transform
We propose and consolidate a definition of the discrete fractional Fourier transform that generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform generalizes the continuous ordinary Fourier transform. This definition is based on a particular set of eigenvectors of the DFT matrix, which constitutes the discrete counterpart of the set of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 47 شماره
صفحات -
تاریخ انتشار 1999